Scaling limit of the uniform prudent walk

Scaling Limit of Loop-erased Random Walk

The loop-erased random walk (LERW) was first studied in 1980 by Lawler as an attempt to analyze self-avoiding walk (SAW) which provides a model for the growth of a linear polymer in a good solvent. The self-avoiding walk is simply a path on a lattice that does not visit the same site more than once. Proving things about the collection of all such paths is a formidable challenge to rigorous math...

On the scaling limit of planar self - avoiding walk

A planar self-avoiding walk (SAW) is a nearest neighbor random walk path in the square lattice with no self-intersection. A planar self-avoiding polygon (SAP) is a loop with no self-intersection. In this paper we present conjectures for the scaling limit of the uniform measures on these objects. The conjectures are based on recent results on the stochastic Loewner evolution and nondisconnecting...

The Scaling Limit of Senile Reinforced Random Walk

Abstract We prove that the scaling limit of nearest-neighbour senile reinforced random walk is Brownian Motion when the time T spent on the first edge has finite mean. We show that under suitable conditions, when T has heavy tails the scaling limit is the so-called fractional kinetics process, a random time-change of Brownian motion. The proof uses the standard tools of time-change and invarian...

Scaling limit of simple random walk on supercritical percolation clusters

Scaling Limit of Loop Erased Random Walk — a Naive Approach

We give an alternative proof of the existence of the scaling limit of loop-erased random walk which does not use Löwner’s differential equation.